Description grammars: Precedents revisited

Local Tree Description Grammars

Context-Free Valence Grammars - Revisited

Context-free valence languages (over Z k) are shown to be cod-ings of the intersection of a context-free language and a blind k-counter language. This afl-style characterization allows one to infer some of the properties of the family of valence languages, in particular the λ-free normal form proved by Fernau and Stiebe.

Double Description Method Revisited

The double description method is a simple and useful algorithm for enumerating all extreme rays of a general polyhedral cone in IR d , despite the fact that we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for eecient implementations, and show some empirical results indicating its practicality ...

Distributed Description Logics Revisited

Distributed Description Logics (DDLs) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping (bridge rules). DDLs capture the idea of importing and reusing concepts between ontologies and thus combine well with intuitions behind Semantic Web. We modify the original semantics of DDLs in order to cope with a modeling discrepancy that has b...

Paraconsistent Description Logics Revisited

Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-tolerant) description logics have been studied by several researchers to cope with such inconsistencies. In this paper, a new paraconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraco...